A Simple Havel–Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs
نویسندگان
چکیده
منابع مشابه
A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs
One of the simplest ways to decide whether a given finite sequence of positive integers can arise as the degree sequence of a simple graph is the greedy algorithm of Havel and Hakimi. This note extends their approach to directed graphs. It also studies cases of some simple forbidden edge-sets. Finally, it proves a result which is useful to design an MCMC algorithm to find random realizations of...
متن کاملA simple criterion on degree sequences of graphs
A finite sequence of nonnegative integers is called graphic if the terms in the sequence can be realized as the degrees of vertices of a finite simple graph. We present two new characterizations of graphic sequences. The first of these is similar to a result of HavelHakimi, and the second equivalent to a result of Erdős & Gallai, thus providing a short proof of the latter result. We also show h...
متن کاملDifferentially Private Graphical Degree Sequences and Synthetic Graphs
Releasing the exact degree sequence of a graph for analysis may violate privacy. However, the degree sequence of a graph is an important summary statistic that is used in many statistical models. Hence a natural starting point is to release a private version of the degree sequence. A graphical degree partition is a monotonic degree sequence such that there exists a simple graph realizing the se...
متن کاملOn degree sequences of undirected, directed, and bidirected graphs
Bidirected graphs generalize directed and undirected graphs in that edges are oriented locally at every node. The natural notion of the degree of a node that takes into account (local) orientations is that of net-degree. In this paper, we extend the following four topics from (un)directed graphs to bidirected graphs: – Erdős–Gallai-type results: characterization of net-degree sequences, – Havel...
متن کاملAlgorithms for realizing degree sequences of directed graphs
The Havel-Hakimi algorithm for constructing realizations of degree sequences for undirected graphs has been used extensively in the literature. A result by Kleitman and Wang extends the Havel-Hakimi algorithm to degree sequences for directed graphs. In this paper we go a step further and describe a modification of Kleitman and Wang’s algorithm that is a more natural extension of Havel-Hakimi’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2010
ISSN: 1077-8926
DOI: 10.37236/338